An Õ(n2.5)-Time Algorithm for Online Topological Ordering
نویسندگان
چکیده
We present an Õ(n)-time algorithm for maintaining the topological order of a directed acyclic graph with n vertices while inserting m edges. This is an improvement over the previous result of O(n) by Ajwani, Friedrich, and Meyer.
منابع مشابه
An Õ(n)-Time Algorithm for Online Topological Ordering
We present an Õ(n)-time algorithm for maintaining the topological order of a directed acyclic graph with n vertices while inserting m edges. This is an improvement over the previous result of O(n) by Ajwani, Friedrich, and Meyer.
متن کامل2 1 Fe b 20 06 An Õ ( n 2 . 75 ) algorithm for online topological ordering ∗
We present a simple algorithm which maintains the topological order of a directed acyclic graph with n nodes under an online edge insertion sequence in Õ(n) time, independent of the number of edges m inserted. For dense DAGs, this is an improvement over the previously best result of O(min{m 32 log n,m 32 +n log n}) by Katriel et al. We also provide an empirical comparison of our algorithm with ...
متن کاملA new approach to incremental topological ordering
Let G = (V,E) be a directed acyclic graph (dag) with n = |V | and m = |E|. We say that a total ordering ≺ on vertices V is a topological ordering if for every edge (u,v) ∈ E , we have u ≺ v. In this paper, we consider the problem of maintaining a topological ordering subject to dynamic changes to the underlying graph. That is, we begin with an empty graph G =(V, / 0) consisting of n nodes. The ...
متن کاملAn $\tilde{O}(n^{2.5})$-Time Algorithm for Online Topological Ordering
We present an Õ(n)-time algorithm for maintaining the topological order of a directed acyclic graph with n vertices while inserting m edges. This is an improvement over the previous result of O(n) by Ajwani, Friedrich, and Meyer.
متن کاملPoint Counting in Families of Hyperelliptic Curves in Characteristic 2
Let ĒΓ be a family of hyperelliptic curves over F cl 2 with general Weierstrass equation given over a very small field F. We describe in this paper an algorithm for computing the zeta function of Ēγ̄, with γ̄ in a degree n extension field of F, which has as time complexity Õ(n3) bit operations and memory requirements O(n2) bits. With a slightly different algorithm we can get time O(n2.667) and me...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0804.3860 شماره
صفحات -
تاریخ انتشار 2008